Zero–One Laws for Connectivity in Random Key Graphs
نویسندگان
چکیده
منابع مشابه
Zero-One Laws for Connectivity in Random Key Graphs
The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen ...
متن کامل2 5 A ug 2 00 9 Zero - one laws for connectivity in random key graphs ∗
The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conje...
متن کاملk-Connectivity of Random Key Graphs
Random key graphs represent topologies of secure wireless sensor networks that apply the seminal Eschenauer– Gligor random key predistribution scheme to secure communication between sensors. These graphs have received much attention and also been used in diverse application areas beyond secure sensor networks; e.g., cryptanalysis, social networks, and recommender systems. Formally, a random key...
متن کاملConnectivity in random key graphs – Simple proofs for special cases
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for some special cases.
متن کاملk-Connectivity in Random Key Graphs With Unreliable Links
Random key graphs form a class of random intersec-tion graphs and are naturally induced by the random key predis-tribution scheme of Eschenauer and Gligor for securing wirelesssensor network (WSN) communications. Random key graphshave received much interest recently, owing in part to theirwide applicability in various domains including recommendersystems, social networks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2181331